Parallel progressive multiple sequence alignment on reconfigurable meshes
نویسندگان
چکیده
منابع مشابه
Multiple Sequence Alignment with Evolutionary-Progressive Method
A new evolutionary-progressive method for Multiple Sequence Alignment problem is proposed. The method efficiently combines flexibility of evolutionary approach with speed and accuracy of progressive technique. The results show that the hybrid method is an interesting alternative for purely genetic or purely progressive approaches.
متن کاملAn Efficient Progressive Alignment Algorithm for Multiple Sequence Alignment
Analyzing and comparing the string representations of sequences reveals a lot of useful information about the sequences. As new biological sequences are being generated at exponential rates, sequence comparison is becoming increasingly important to draw functional and evolutionary inference of proteins. This paper presents a partitioning approach for biomolecular sequence alignment that signifi...
متن کاملParallel Multiple Sequence Alignment: An Overview
Multiple Sequence Alignment (MSA) is a fundamental analysis method used in bioinformatics and many comparative genomic applications. The time to compute an optimal MSA grows exponentially with respect to the number of sequences. Consequently, producing timely results on large problems requires more e cient algorithms and the use of parallel computing resources. In response to a growing volume o...
متن کاملDependency-Free Parallel Progressive Meshes
The constantly increasing complexity of polygonal models in interactive applications poses two major problems. First, the number of primitives that can be rendered at real-time frame rates is currently limited to a few million. Second, less than 45 million triangles – with vertices and normal – can be stored per gigabyte. While the rendering time can be reduced using level-of-detail (LOD) algor...
متن کاملParallel Multiple Sequence Alignment Using Speculative Computation
Many different methods have been presented for aligning multiple biological sequences. These methods can be classified into three categories: rigorous, tree-based, and iterative. The rigorous method, which always generates the optimal alignment, requires memory space and computation time proportional to the product of the sequence lengths. Even for a modest number of sequences, this method beco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Genomics
سال: 2011
ISSN: 1471-2164
DOI: 10.1186/1471-2164-12-s5-s4